Pseudorandom Generators for Read-Once ACC
نویسندگان
چکیده
We consider the problem of constructing pseudorandom generators for read-once circuits. We give an explicit construction of a pseudorandom generator for the class of read-once constant depth circuits with unbounded fan-in AND, OR, NOT and generalized modulo m gates, where m is an arbitrary fixed constant. The seed length of our generator is poly-logarithmic in the number of variables and the error. Keywords-Pseudorandom generators; Derandomization; Random restrictions
منابع مشابه
Improved Pseudorandom Generators for Depth 2 Circuits
We prove the existence of a poly(n,m)-time computable pseudorandom generator which “1/poly(n,m)-fools” DNFs with n variables and m terms, and has seed length O(log nm · log log nm). Previously, the best pseudorandom generator for depth-2 circuits had seed length O(log nm), and was due to Bazzi (FOCS 2007). It follows from our proof that a 1/m-biased distribution 1/poly(nm)-fools DNFs with m ter...
متن کاملA Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width
Recently, an interest in constructing pseudorandom or hitting set generators for restricted branching programs has increased, which is motivated by the fundamental issue of derandomizing space-bounded computations. Such constructions have been known only in the case of width 2 and in very restricted cases of bounded width. In this paper, we characterize the hitting sets for read-once branching ...
متن کاملMore on bounded independence plus noise: Pseudorandom generators for read-once polynomials
We construct pseudorandom generators with improved seed length for several classes of tests. First we consider the class of read-once polynomials over GF(2) in m variables. For error ε we obtain seed length Õ(log(m/ε)) log(1/ε), where Õ hides lower-order terms. This is optimal up to the factor Õ(log(1/ε)). The previous best seed length was polylogarithmic in m and 1/ε. Second we consider produc...
متن کاملA Polylogarithmic PRG for Degree 2 Threshold Functions in the Gaussian Setting
We construct and analyze a new pseudorandom generator for degree 2 polynomial threshold functions with respect to the Gaussian measure. In particular, we obtain one whose seed length is polylogarithmic in both the dimension and the desired error, a substantial improvement over existing constructions. Our generator is obtained as an appropriate weighted average of pseudorandom generators against...
متن کاملHitting Sets with Near-Optimal Error for Read-Once Branching Programs
Nisan [Nis92] constructed a pseudorandom generator for length n, width n read-once branching programs (ROBPs) with error ε and seed length O(log n+ log n · log(1/ε)). A major goal in complexity theory is to reduce the seed length, hopefully, to the optimal O(log n+log(1/ε)), or to construct improved hitting sets, as these would yield stronger derandomization of BPL and RL, respectively. In cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012